A simple proof of functional completeness in many-valued logics based on Ł ukasiewicz's $C$ and $N$.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof search and Co-NP completeness for many-valued logics

We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a sufficient condition for their Co-NP completeness. Our results apply to many well known logics including Gödel, Lukasiewicz and Product Logic, as well as Hájek’s Basic Fuzzy Logic.

متن کامل

Modal Systems Based on Many-valued Logics

We propose a general semantic notion of modal many-valued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing literature with respect to this framework.

متن کامل

A Simple Modal Encoding of Propositional Finite Many-Valued Logics

We present a method for testing the validity for any finite manyvalued logic by using simple transformations into the validity problem for von Wright’s logic of elsewhere. The method provides a new original viewpoint on finite many-valuedness. Indeed, we present a uniform modal encoding of any finite many-valued logic that views truth-values as nominals. Improvements of the transformations are ...

متن کامل

Many-Valued Logics

The paper considers the fundamental notions of manyvalued logic together with some of the main trends of the recent development of infinite valued systems, often called mathematical fuzzy logics. Besides this logical approach also a more algebraic approach is discussed. And the paper ends with some hints toward applications which are based upon actual theoretical considerations about infinite v...

متن کامل

Many-valued modal logics

Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and compl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1962

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093957156